#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <queue>
using namespace std;
queue<int> q;
int a[100005];
int main()
{
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		scanf("%d",a+i);
	}
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++)
	{
		if(!q.empty()&&a[i]>q.front())
		{
			q.pop();
		}
		q.push(a[i]);
	}
	cout<<q.size()<<endl;
	return 0;
}

